Public Key Searchable Encryption without Random Oracle ⋆
نویسندگان
چکیده
This article is described a new Public Key Encryption with Keyword Search (PEKS) scheme, which is semantically secure against chosen keyword attack, without assuming random oracle. The security of our scheme depends on the complexity assumption of Strong Diffie-Hellman (SDH). The computation operation for constructing cipher text and trapdoor of keyword is simpler than the most schemes introduced before, and the complexity of searching in our scheme is lower than many schemes. Moreover, comparing with the previous system, our PEKS which is based on standard model has higher security.
منابع مشابه
Decryptable Searchable Encryption
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An additional feature is that the decryption key and the trapdoor derivation key are totally independent, thereby complying with many contexts of a...
متن کاملDynamic Searchable Public-Key Ciphertexts with Fast Performance and Practical Security
Public-key encryption with keyword search (PEKS) allows a sender to generate keyword-searchable ciphertexts using a receiver’s public key and upload them to a server. Upon receiving a keyword-search trapdoor from the receiver, the server finds all matching ciphertexts. Due to the characteristics of public-key encryption, PEKS is inherently suitable for the application of numerous senders. Hence...
متن کاملFast Keyword Search Using Public-Key Ciphertexts With Hidden Structures
Searchable Public-Key Ciphertexts with Hidden Structures for keyword search is as fast as possible without sacrificing semantic security of the encrypted keywords. In SPCHS, all keyword-searchable ciphertexts are structured by hidden relations, and with the search trapdoor corresponding to a keyword, the minimum information of the relations is disclosed to a search algorithm as the guidance to ...
متن کاملSearchable Keyword-Based Encryption
To solve the problem of searching on encrypted data, many keyword search schemes have been proposed in recent years. The goal of such schemes is to enable a user to give an untrusted storage server the ability only to test whether an encrypted document contains a few keywords without learning anything else about the document. In this paper, we are concerned with decrypting the searched results ...
متن کاملPublic Key Encryption with ’Fixed and Short Length’ Keyword Search
Cloud computing has emerged as a new technology that aims to provide unlimited virtualized resources to clients and enterprises. As services and huge sensitive data are being moved to the cloud server, a new challenge arises as to how to use the migrated data in a way that preserves privacy. Due to privacy concerns, important data should be encrypted before uploading onto cloud servers, so that...
متن کامل